Proof-Pattern Recognition and Lemma Discovery in ACL2
نویسندگان
چکیده
We present a novel technique for combining statistical machine learning for proof-pattern recognition with symbolic methods for lemma discovery. The resulting tool, ACL2(ml), gathers proof statistics and uses statistical pattern-recognition to pre-processes data from libraries, and then suggests auxiliary lemmas in new proofs by analogy with already seen examples. This paper presents the implementation of ACL2(ml) alongside theoretical descriptions of the proof-pattern recognition and lemma discovery methods involved in it.
منابع مشابه
A Formal Proof of Dickson's Lemma in ACL2
Dickson’s Lemma is the main result needed to prove the termination of Buchberger’s algorithm for computing Gröbner basis of polynomial ideals. In this case study, we present a formal proof of Dickson’s Lemma using the ACL2 system. Due to the limited expressiveness of the ACL2 logic, the classical non-constructive proof of this result cannot be done in ACL2. Instead, we formalize a proof where t...
متن کاملProof of Dickson’s Lemma Using the ACL2 Theorem Prover via an Explicit Ordinal Mapping
In this paper we present the use of the ACL2 theorem prover to formalize and mechanically check a new proof of Dickson’s lemma about monomial sequences. Dickson’s lemma can be used to establish the termination of Büchberger’s algorithm to find the Gröbner basis of a polynomial ideal. This effort is related to a larger project which aims to develop a mechanically verified computer algebra system.
متن کاملBuilding Lemmas Using Examples
We present a heuristic for automated lemma discovery that generates lemmas that might help ACL2 in proving theorems like ∀x : t1(x) = t2(x). This heuristic exploits manually created examples of x. These examples are used to produce ground terms t′1 and t ′ 2, for which semantical models are built. In order to generate useful intermediate lemmas, we search for a specific pattern in these two mod...
متن کاملACL2(ml): Machine-Learning for ACL2
ACL2(ml) is an extension for the Emacs interface of ACL2. This tool uses machine-learning to help the ACL2 user during the proof-development. Namely, ACL2(ml) gives hints to the user in the form of families of similar theorems, and generates auxiliary lemmas automatically. In this paper, we present the two most recent extensions for ACL2(ml). First, ACL2(ml) can suggest now families of similar ...
متن کاملObtaining an ACL2 Specification from an Isabelle/HOL Theory
In this work, we present an interoperability framework that enables the translation of specifications (signature of functions and lemma statements) among different theorem provers. This translation is based on a new intermediate XML language, called XLL, and is performed almost automatically. As a case study, we focus on porting developments from Isabelle/HOL to ACL2. In particular, we study th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013